Learning opacity in Stratal Maximum Entropy Grammar
نویسندگان
چکیده
منابع مشابه
Learning opacity in Stratal Maximum Entropy Grammar
(Kiparsky 1971, 1973) draws attention to cases of historical change that suggest that at least some opaque phonological process interactions are difficult to learn. In his work on Stratal Optimality Theory (Stratal OT), he further claims that independent evidence about the stratal affiliation of a process is helpful in learning an opaque interaction (Kiparsky 2000). In this paper, we develop a ...
متن کاملOpacity in Lardil: stratal vs. serial derivations in OT
is paper presents a derivational OT account of the word-nal deletion and augmentation alternations in Lardil. It presents two arguments in favor of the stratal view of derivations where the grammar is dierent at dierent stages (Bermúdez-Otero forthcoming, Kiparsky forthcoming), and against the serial view where the ranking is the same at all steps, and each step constitutes a minimal change ...
متن کاملMorphologically-conditioned tonotactics in multilevel Maximum Entropy grammar*
Phonological sensitivity to lexical class has been addressed in the literature; at least two sets of hypotheses have been advanced regarding its codification in grammar. The first type of approach holds that lexical class differences are limited by restrictions in the design of grammar itself (or more specifically, Universal Grammar): for example, it has been hypothesized that only faithfulness...
متن کاملDoes MaxEnt Overgenerate? Implicational Universals in Maximum Entropy Grammar
It goes without saying that a good linguistic theory should neither undergenerate (i.e., it should not miss any attested patterns) nor overgenerate (i.e., it should not predict any “unattestable” patterns). Recent literature has argued that the Maximum Entropy (ME; Goldwater & Johnson 2003) framework provides a probabilistic extension of categorical Harmonic Grammar (HG; Legendre et al. 1990; S...
متن کاملMaximum Entropy and Learning Theory
We derive the learning theory recently reported by Tishby, Levin, and Solla (TLS) without statistical mechanics. We show that the theory generally applies to any problem of modeling data. We analyze an elementary example for which we find the predictions consistent with intuition and conventional statistical results. We numerically examine the more realistic problem of training a competitive ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Phonology
سال: 2017
ISSN: 0952-6757,1469-8188
DOI: 10.1017/s095267571700015x